Some partitions associated with a partially ordered set
نویسندگان
چکیده
منابع مشابه
Partitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملSampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملChapter 4 Partitions of a Finite Partially Ordered Set Contributed Chapter
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملPattern Avoidance in Ordered Set Partitions
In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for certain special cases, and a recursive technique to exactly enumerate the appropriate set partitions in general. We also give some asymptotic results for the growth rates of the number of ordered set partitions avoiding a single pattern; includ...
متن کاملSome Bijections on Set Partitions
We study three similar bijections on set partitions. The first is an involution defined by Kasraoui and Zeng which proves the symmetry of the distribution of crossings and nestings. We show that a stronger result can be deduced. The second gives a bijective proof of the equivalence of two statistics with a q-Stirling distribution. The third proves the equivalence of a multivariate block size di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1976
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90078-9